//https://leetcode.cn/problems/target-sum/

class Solution {
public:
    int findTargetSumWays(vector<int>& nums, int target) {
        int n = nums.size();
        int sum = 0;
        for (auto e : nums) sum += e;
        int aim = (sum + target) / 2;
        if ((sum + target) % 2 == 1 || aim < 0) return 0;


        vector<vector<int>> dp(n + 1, vector<int>(aim + 1));

        dp[0][0] = 1;

        for (int i = 1; i <= n; i++)
        {
            for (int j = 0; j <= aim; j++)
            {
                dp[i][j] = dp[i - 1][j] + (j >= nums[i - 1] ? dp[i - 1][j - nums[i - 1]] : 0);
            }
        }

        return dp[n][aim];

    }
};